1266. Minimum Time Visiting All Points.go

package leetcode

funcminTimeToVisitAllPoints(points [][]int) int {
res:=0
fori:=1; i<len(points); i++ {
res+=max(abs(points[i][0]-points[i-1][0]), abs(points[i][1]-points[i-1][1]))
 }
returnres
}

funcmax(aint, bint) int {
ifa>b {
returna
 }
returnb
}

funcabs(aint) int {
ifa>0 {
returna
 }
return-a
}